#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN=800;
int x[MAXN];
int y[MAXN];
int main(void){
    int n;
    while(~scanf("%d",&n)){
        memset(x,0,sizeof(x));
        memset(y,0,sizeof(y));
        for(int i=0;i<n;i++){
            scanf("%d%d",&x[i],&y[i]);
        }
        int ans=0;
        int cnt=0;
        for(int i=0;i<n-2;i++){
            for(int j=i+1;j<n-1;j++){
                cnt=2;
                for(int k=j+1;k<n;k++){
                    if((x[i]-x[j])*(y[i]-y[k])==(y[i]-y[j])*(x[i]-x[k])){
                        cnt++;
                    }
                }
                ans=max(ans,cnt);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}
